Constrained optimization tool

ABSTRACT

A system for finding a solution to a constrained optimization problem is disclosed. The system uses a mathematical formulation describing the constrained optimization problem. A transformer builds a specific function using the mathematical formulation, variables; an objective function; at least one constraint; a class of transformation functions with a predefined set of properties; and Lagrange multipliers. The specific function may include a nonlinear resealing part; and an augmented Lagrangian part. An iterative solver uses the specific function, and Lagrange multipliers to generate a solution.

CROSS-REFERENCE TO RELATED APPLICATIONS

The present application claims the benefit of provisional patent applications:

-   -   a) Ser. No. 60/330,864 to POLYAK et al., filed on Nov. 1, 2001;         and     -   b) Ser. No. 60/340,861 to POLYAK et al., filed on Dec. 19, 2001,         entitled “Primal-Dual Modified Barrier Augmented Lagrangian         system and method for solving constrained optimization         problems”,         which are hereby incorporated by reference.

BACKGROUND OF THE INVENTION

The present invention relates to the field of constraint optimization. More specifically, the present invention provides for finding optimized solutions of constrained problems using a Nonlinear resealing-Augmented Lagrangian solver.

BRIEF SUMMARY OF THE INVENTION

One advantage of the invention is it may be applied to many different types of constrained problems.

Another advantage of the invention is that it may be implemented in software.

Another advantage of the invention is that it may handle problems with both inequality constraints and equations without transforming one set of constraints into another one.

Another advantage of the invention is that it does not require the unbounded increase of the barrier-penalty parameter to guarantee convergence as it happened in the Interior Point and Penalty type methods.

Yet another advantage of the invention is that it allows to avoid the ill conditioning, i.e. the condition number of the MBAL Hessian is stable when the primal-dual approximation approaches the primal-dual solution. In turn, it keeps stable the area where Newton's method is well defined.

Yet another advantage of the invention is that under the standard second order optimality conditions it converges with Q-linear rate when the barrier-penalty parameter is fixed. The ratio may be made as small as one wants by choosing a fixed but large enough parameter.

Yet another advantage of the invention is that it eliminates the combinatorial nature of constrained optimization with inequality constraints.

Yet another advantage of the invention is that it does not require an interior starting point for constrained optimization with inequality constraints.

To achieve the foregoing and other advantages, in accordance with all of the invention as embodied and broadly described herein, a system for finding a solution to a constrained optimization problem comprising: a mathematical formulation describing the constrained optimization problem; the mathematical formulation including: variables; an objective function; at least one constraint selected from the group consisting of: an inequality constraint; and an equality constraint; a class of transformation functions with a predefined set of properties; Lagrange multipliers; a scaling parameter; a transformer capable of building a specific function from the mathematical formulation, the Lagrange multipliers and the scaling parameter using the class of transformation functions, the specific function further including: a nonlinear resealing part; and a augmented Lagrangian part; a Lagrange multipliers updater capable of calculating updated Lagrange multipliers; a scaling parameter updater capable of calculating an updated scaling parameter; a merit function calculator capable of calculating a merit function; a general stopping criteria verifier; an accuracy of solution parameter; and an iterative solver capable using the specific function, the Lagrange multipliers updater and the scaling parameter updater to generate the solution.

In yet a further aspect of the invention, a method for finding a solution to a constrained optimization problem comprising the steps of: defining a mathematical formulation describing said problem; said mathematical formulation including: variables; an objective function; inequality constraints; and equality constraints; selecting initial Lagrange multipliers; select an initial scaling parameter; selecting initial variables; building a specific function from said mathematical formulation, said Lagrange multipliers and said scaling parameter using an element of a class of transformation functions having a predefined set of properties, said specific function further including: a nonlinear resealing part; and an augmented Lagrangian part; perform a nonlinear resealing augmented Lagrangian iterative algorithm.

Additional objects, advantages and novel features of the invention will be set forth in part in the description which follows, and in part will become apparent to those skilled in the art upon examination of the following or may be learned by practice of the invention. The objects and advantages of the invention may be realized and attained by means of the instrumentalities and combinations particularly pointed out in the appended claims.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

The accompanying drawings, which are incorporated in and form a part of the specification, illustrate an embodiment of the present invention and, together with the description, serve to explain the principles of the invention.

FIG. 1 is a block diagram of a constrained optimizer as per an aspect of an embodiment the present invention.

FIG. 2 is a block diagram of a mathematical formulation of a constrained optimization problem as per an aspect of an embodiment of the present invention.

FIG. 3 is a block diagram of transformation function properties as per an aspect of an embodiment of the present invention.

FIG. 4A is a block diagram of additional transformation function properties as per an aspect of an embodiment of the present invention.

FIG. 4B is a block diagram of additional transformation function properties as per an aspect of an embodiment of the present invention.

FIG. 5A is a block diagram of Lagrange multipliers as per an aspect of an embodiment of the present invention.

FIG. 5B is a block diagram of a Lagrange multipliers updater as per an aspect of an embodiment of the present invention.

FIG. 5C is a Lagrange multipliers formula that responds to inequality constraints as per an aspect of an embodiment of the present invention.

FIG. 5D is a Lagrange multipliers formula that responds to equality constraints as per an aspect of an embodiment of the present invention.

FIG. 6A is a block diagram showing a scaling parameter as per an aspect of an embodiment of the present invention.

FIG. 6B is a block diagram of a scaling parameter updater as per an aspect of an embodiment of the present invention.

FIG. 6C is a scaling parameter formula as per an aspect of an embodiment of the present invention.

FIG. 7A is a block diagram showing a specific function as per an aspect of an embodiment of the present invention.

FIG. 7B is a block diagram showing parts of a specific function as per an aspect of an embodiment of the present invention.

FIG. 8A is a block diagram showing a merit function calculator as per an aspect of an embodiment of the present invention.

FIG. 8B is a block diagram showing an accuracy of solution parameter as per an aspect of an embodiment of the present invention.

FIG. 9 is a flow diagram of a of a constrained optimizer as per an aspect of an embodiment of the present invention.

FIG. 10 is a block diagram of a MIN_UPDATE iterative solver as per an aspect of the present invention.

FIG. 11 is a flow diagram of a MIN_UPDATE iterative solver as per an aspect of an embodiment of the present invention.

FIG. 12 is a block diagram of a PRIMAL DUAL iterative solver as per an aspect of the present invention.

FIG. 13 is a flow diagram of a PRIMAL DUAL iterative solver as per an aspect of an embodiment of the present invention.

DETAILED DESCRIPTION OF THE INVENTION

The present invention is a system for finding a solution 100 to a constrained optimization problem 110. Since most problems have constraints of one type or another, one may realize that many problems may be described as a constrained optimization problem 110. Examples may include power flow problems, image reconstruction problems, pattern recognition problems, data processing problems, network flow problems, optimal control problems, optimal design problems, etc. Further, one skilled in the art will recognize that may other types of problems may be expressed as a constrained optimization problem for which the present invention may be used.

Solution(s) 100 to the constrained optimization problem 110 may be a vector of decision variables that minimize given criteria and satisfy given constraints. The given criteria may be provided as part of the problem description and may describe a preferred outcome. This description is preferably provided as a mathematical formulation 120. For the purposes of the present invention, alternate descriptions may be translated into a mathematical formulation 120.

The system includes but is not limited to: a mathematical formulation 120 describing the constrained optimization problem 110; a class of transformation functions 170; Lagrange multipliers 190; a scaling parameter 200; a transformer 220; a Lagrange multipliers updater 260; a scaling parameter updater 280; a merit function calculator 300; a general stopping criteria verifier 800; an accuracy of solution parameter 320; and an iterative solver 330. One skilled in the art will recognize that aspects of this system may be reproduced using equivalent components or methods. This invention is intended to cover these equivalent embodiments. Further, it may be possible to practice the invention without all of the listed elements. For example, the accuracy of solution parameter 320 is useful in providing input into the system in deciding when a solution is close enough. One skilled in the art will recognize that this function may be built into the system without necessarily needing a parameter.

As illustrated in FIG. 2, the system may include a mathematical formulation 120. The mathematical formulation 120 should include an objective function 140 f(x); and at least one constraint 145. The objective function 140 may be a function of many variables. Both the constraint(s) 145 and objective function 140 may depend upon variables 130 x=(x₁, . . . , x_(n)). The constraint(s) 150 may further include at least one inequality constraint 150 c_(i)(x)≧0, i=1, . . . , p; and/or at least one equality constraint 160 e_(j)(x)=0, j=1, . . . , q. It is possible that problem will only have one constraint 145, or only one type of constraint. For example, for p=0, the problem may have no inequality constraints 150. Similarly, q=0 may result in no equality constraints 160. Further, the mathematical formulation 120 may include the objective function 140 being minimized, subject to the inequality constraints 150 and the equality constraints 160.

One skilled in the art will recognize that much of this disclosure uses notation that should not be construed literally. For example, variables have just been noted as variables x. However, variables could just as easily be noted as variables y, or k, or z.

Further, the system may include a class of transformation functions 170 having certain properties 180. Referring to FIG. 3, we may see an example of a transformation function 170 exhibiting properties 180 as per an embodiment of the present invention. Preferably, at least some of the properties will be a predefined set of properties 180. A first predefined property 400 may be that the transformation function is a function of one variable between a and b ψ(t):

¹→

¹ defined on −∞≦a<t<b≦∞ 400. Point ‘a’ may be a negative point or minus infinity and point ‘b’ may be a positive point or plus infinity. A second property 410 may be that the function passes through zero coordinate ψ(0)=0. A third property 420 may be that the slope of the function as it passes through zero be 45 degrees ψ′(0)=1. A fourth property 430 may be that the function is increasing ψ″(t)>0 430.

FIG. 4A shows a fifth property 440 and sixth property 450. These properties constrain the function to be concave ψ″(t)<0; and have a slope of zero at point ‘b’. Alternately, the properties are shown in FIG. 4B to respond to an alternative mathematical formulation with the following inequality constraints for 150 c_(i)(x)≦0; i=1, . . . , p of the same problem. The fifth property 440 a and sixth property 450 a constrain the function to be convex ψ″(t)>0; and have with a slope of zero at point ‘a’

${\lim\limits_{t->a}{{\psi'}(t)}} = 0.$

The transformer 220 preferably builds a specific function 230 L(x,λ,v,k) from the mathematical formulation 120, the Lagrange multipliers 190 and the scaling parameter 200 using the class of transformation functions 170. The specific function 230 may then depend upon variables 130, Lagrange multipliers 190 and the scaling parameter 200. The specific function 230 preferably has a nonlinear resealing part 240 and a augmented Lagrangian part 250. The specific function 230 may include

${f(x)} - {k^{- 1}{\sum\limits_{i = 1}^{p}{\lambda_{i}{\psi\left( {k\;{c_{i}(x)}} \right)}}}} - {\sum\limits_{j = 1}^{q}{v_{j}{e_{j}(x)}}} + {0.5{\sum\limits_{j = 1}^{q}{k\;{e_{i}^{2}(x)}}}}$

The scaling parameter 200 k maybe a singular 1 dimensional scaling variable. Although the present invention is described using a single scaling parameter, in fact, a system as per this invention may use many scaling parameters or no scaling parameters. In the case of using many scaling parameters, it is possible that a separate scaling parameter could be used for each and every inequality and/or equality constraint. The use of a scaling factor may be totally dependent upon the specific implementation, and/or the power of the solving system.

FIG. 5A shows Lagrange multipliers 190 λ=(λ₁, . . . , λ_(p)) v=(v₁, . . . , v_(q)) which are multi-dimensional parameters. Multipliers λ=(λ₁, . . . , λ_(p)) may respond to inequality constraints. Similarly, v=(v₁, . . . , v_(q)) may respond to equality constraints. As shown in FIG. 5B, the Lagrange multipliers updater 260 capable of calculating updated Lagrange multipliers 270 {circumflex over (λ)}=({circumflex over (λ)}₁, . . . , {circumflex over (λ)}_(m)), {circumflex over (v)}=({circumflex over (v)}₁, . . . , {circumflex over (v)}_(q)) from Lagrange multiplier 190. In some embodiments, it is possible for updated Lagrange multiplier 270 to be used as Lagrange multipliers 190, especially when the Lagrange multiplier updater 260 is used in an iterative solver 330. The Lagrange multipliers updater 260 may include Lagrange multipliers update formulas 500. FIG. 5C is an example from a best embodiment of an update formula for the Lagrange multipliers 190 which respond to inequality constraints. Similarly, FIG. 5D shows an example from a best embodiment of an update formula for the Lagrange multipliers 190 which respond to equality constraints.

FIG. 6A is a block diagram showing a scaling parameter as per an aspect of an embodiment of the present invention. FIG. 6B is a block diagram of a scaling parameter updater as per an aspect of an embodiment of the present invention. The scaling parameter updater 280 which may generate an updated scaling parameter 290 from a scaling parameter 200. In some embodiments, it is possible for an updated scaling parameter 290 to be used as a scaling parameter 200, especially when the scaling parameter updater 280 is used in an iterative solver 330. The scaling parameter updater 280 may include a scaling parameter update formula. FIG. 6C is an example from a best embodiment of a formula for updating a scaling parameter 200.

FIG. 7A is a block diagram showing a specific function as per an aspect of an embodiment of the present invention. The specific function 230 may depend upon variables 130, Lagrange multipliers 190 and scaling parameter 200. FIG. 7B is a block diagram showing parts of a specific function as per an aspect of an embodiment of the present invention. The specific function 230 preferably includes the objective function 140, and has a nonlinear resealing part 240 and a augmented Lagrangian part 250. The nonlinear resealing part 240 may includes

$k^{- 1}{\sum\limits_{i = 1}^{p}{\lambda_{i}{\psi\left( {{kc}_{i}(x)} \right)}}}$ and the augmented Lagrangian part 250 may include

${- {\sum\limits_{j = 1}^{q}{v_{j}{e_{j}(x)}}}} + {0.5{\sum\limits_{j = 1}^{q}{{{ke}_{i}^{2}(x)}.}}}$

FIG. 8A is a block diagram showing a merit function calculator as per an aspect of an embodiment of the present invention. The merit function calculator 300 preferably uses a merit function 305 μ(x,λ,v) dependent upon variables 130, and Lagrange multipliers 190 to calculate a merit value. FIG. 8B is a block diagram showing a general stopping criteria verifier 800 as per an aspect of an embodiment of the present invention. The general stopping criteria 800 may be used in determining when the iterative solver 330 should terminate and may use an accuracy of solution parameter. The general stopping criteria verifier 800 may compare the merit function 305 against the accuracy of solution parameter to decide when solution is accurate enough. The general stopping criteria 310 may consider whether the merit function 305 is equal or less than the accuracy of solution parameter. The scaling parameter updater 280 may also use the merit function 305.

A constrained optimization problem 110 may be solved using the present invention by the method shown in FIG. 9. At step S10, a mathematical formulation 120 describing the constrained optimization problem 110 may be generated. The mathematical formulation 120 may include variables 130, an objective function 140, inequality constraints 150, and equality constraints 160. Next at step S12, initial variables 130 and Lagrange multipliers 190 may be selected. An initial scaling parameter 200 k may be selected at step S14, and transformation functions 170 may be selected at step S16.

A specific function 230 may them be built at step S18 from the mathematical formulation 120, the Lagrange multipliers 190, and the scaling parameter 200 using an element of a class of transformation functions 170 having a predefined set of properties 180. The specific function 230 may further include a nonlinear resealing part 240; and a augmented Lagrangian part 250. At step S20, a nonlinear resealing augmented Lagrangian iterative algorithm may be performed.

The iterative solver 330 may be a MIN_UPDATE solver 600. FIG. 10 is a block diagram of a MIN_UPDATE iterative solver 600 as per an aspect of the present invention. FIG. 11 is a flow diagram of a MIN_UPDATE iterative solver as per an aspect of an embodiment of the present invention. This MIN_UPDATE iterative solver 600 is a best mode iterative solver 330. At step S30, a specific function 230 may be inputted into a specific function minimizer in variables device 610. At step S32, initial variables 130 may be inputted into the specific function minimizer in variables device 610. At step S34, initial Lagrange multipliers 190 may be inputted into the specific function minimizer in variables device 610. At step S36, a scaling parameter 280 may be inputted into the specific function minimizer in variables device 610.

Next, at step S38, the specific function minimizer in variables device 610 preferably performs an unconstrained minimization of the specific function 230. This minimization may keep occurring until a minimizer stopping criteria checker 220 decides that the minimization has satisfied a minimizer stopping criteria 630. The minimizer stopping criteria 630 may uses an accuracy of minimizer parameter. The updated variables ({circumflex over (x)}) may need to satisfy the minimizer stopping criteria 630. Parameters may then be updated at step S40 by a Lagrange multipliers parameter updater 260 and a scaling parameter updater 280. The minimizer stopping criteria 630 may use updated variables 620, Lagrange multipliers 190, scaling parameter 200, updated Lagrange multipliers 270, or a stopping inequality verifier 650 when making its' determination.

At step S42, a general stopping criteria verifier 800 may make a determination as to whether the parameters and variables satisfy a general stop criteria. The general stopping criteria verifier 800 may use updated variables 620, updated Lagrange multipliers 270, or a stopping criteria 310 when making its' determination. If the determination is negative, then the updated Lagrange multipliers 270 and the updated scaling factor 290 may be input to the specific function minimizer in variables device 610 for another iteration. If the determination is positive, then the optimization may end and an optimized solution 230 outputted.

The iterative solver 330 may be a PRIMAL DUAL iterative solver 700. FIG. 12 is a block diagram of a PRIMAL DUAL iterative solver 700 as per an aspect of the present invention. FIG. 13 is a flow diagram of an PRIMAL DUAL iterative solver 700 as per an aspect of an embodiment of the present invention. This PRIMAL DUAL iterative solver 700 may include a primal-dual system of equations which may also include a gradient of classical Lagrangian and Lagrange multipliers update formulas. Variable together with Langrange multipliers may be alternatively be called primal dual variables. Further, the gradient of classical Lagrangian may equal zero. At step S52, initial variables 130 may be input to a linear system to find Newton directions 710. The linear system to find Newton directions 610 may be implemented in hardware or software. Next at step S54, largrange multipliers 190 may be input to the linear system for Newton directions device 710. A scaling parameter 280 may be input to the linear system for Newton directions device at step S56.

The linear system to find Newton directions 710 may then solve the linear system at step S58. A predictor corrector algorithm 740 may be used to help solve the linear system for Newton directions. The predictor corrector algorithm 740 may use inequality predictors ( λ), equality predictors ( v), a primal corrector (Δx), a primal linear system, inequality correctors (Δλ), equality correctors (Δv), and/or a primal-dual updater.

Parameters may then be updated at step S60 by a primal dual updater 790 and a scaling parameter updater 280. Then, at step S62, a general stopping criteria verifier 800 may make a determination as to whether the parameters and variables satisfy a general stopping criteria. If the determination is negative, then the updated Lagrange multipliers 270, updated variables 130, and the updated scaling factor 290 may be input to the linear system for Newton directions device 710 for another iteration. If the determination is positive, then the optimization may end and an optimized solution 230 outputted.

A mathematical explanation of a nonlinear resealing-augmented Lagrangian solver (MRALS) as per the present invention will now be disclosed as. Let f(x), c_(i)(x), i=1, . . . , p and e_(j)(x), j=1, . . . , q are smooth enough functions. Constrained optimization problem with both inequality and equality constraints consists in finding a solution of the following primal problem (mathematical formulation) f(x*)={f(x)|c _(i)(x)≧0, i=1, . . . , p; e _(j)(x)=0, j=1, . . . , q}  (1)

The classical Lagrangian associated with problem (1) may be given by the formula:

$\begin{matrix} {{L\left( {x,\lambda,v} \right)} = {{f(x)} - {\sum\limits_{i = 1}^{p}{\lambda_{i}{c_{i}(x)}}} - {\sum\limits_{j = 1}^{q}{v_{j}{e_{j}(x)}}}}} & (2) \end{matrix}$ where λ=(λ₁, . . . , λ_(p)) is a vector of the Lagrange multipliers associated with inequality constraints and v=(v₁, . . . , v_(q)) is a vector of the Lagrange multipliers associated with equality constraints.

Along with the primal problem (1), the present invention also considers the dual problem for y=(λ,v) d(y*)={d(y)≡d(x,λ)|λ_(i)≧0, i=1, . . . , p}  (3) where

${d(y)} = {{d\left( {\lambda,v} \right)} = {\inf\limits_{x}\;{L\left( {x,y} \right)}}}$ is the dual function.

The present solver may solve both the primal (1) and the dual (3) problems. Let −∞≦a<0<b≦∞. we consider a class class Ψ of twice continuously differential transformation functions, which satisfy the following properties:

i) ψ(t):

¹→

¹ defined on −∞≦a<t<b≦∞

ii) ψ(0)=0

iii) ψ′(0)=1

iv) ψ′(t)>0

v) ψ″(t)<0 and

vi)

${\lim\limits_{t\rightarrow b}\;{\psi^{\prime}(t)}} = 0.$

The functions ψεΨ we use to transform inequality constraints of a given constrained optimization problem into equivalent set of constraints.

Let us consider a few examples ψεΨ.

Logarithmic Modified Barrier Function (MBF): ψ₁(t)=ln(t+1),

Hyperbolic MBF:

${\psi_{1}(t)} = {\frac{t}{t + 1}.}$

Each of above transformations may be modified in the following way. For a given −1<τ<0 a quadratic extrapolation of the transformations 1–2 may be defined by formulas.

A third example may be described by:

${\psi_{qi}(t)} = \left\{ {\begin{matrix} {{\psi_{i}(t)},} & {t \geq \tau} \\ {{q_{i}(t)} = {{a_{i}t^{2}} + {b_{i}t} + c_{i}}} & {t \leq \tau} \end{matrix},} \right.$ where a_(i), b_(i) and c_(i) may be found from the following equations: ψ_(i)(τ)=q_(i)(τ), ψ′₁(τ)=q′₁(τ) and ψ″₁(τ)=q″₁(τ). Equations a_(i)=0.5ψ″₁(τ), b₁=ψ′(τ)−τψ″_(i)(τ), and c_(i)ψ(τ)−τψ′(τ)+0.5τ²ψ″_(i)(τ), may be obtained so that ψ_(q) _(i) (t)εC².

The specific function

(x,λ,v,k) is preferably defined by the formula:

${\left( {x,\lambda,v,k} \right)} = {{f(x)} - {k^{- 1}{\sum\limits_{i = 1}^{p}{\lambda_{i}{\psi\left( {k\;{c_{i}(x)}} \right)}}}} - {\sum\limits_{j = 1}^{q}{v_{j}{e_{j}(x)}}} + {0.5k{\sum\limits_{j = 1}^{q}{e_{j}^{2}(x)}}}}$ This formula has three parts:

-   -   1. An objective function f(x);     -   2. a nonlinear resealing part:

${k^{- 1}{\sum\limits_{t = 1}^{p}{\lambda_{i}{\psi\left( {{kc}_{i}(x)} \right)}}}},$

-   -    which corresponds to the inequality constraints; and     -   3. an augmented Lagrangian part:

${{\sum\limits_{j = 1}^{q}{v_{j}{e_{j}(x)}}} + {0.5k{\sum\limits_{j = 1}^{q}{e_{j}^{2}(x)}}}},$

-   -    which corresponds to equality constraints.

A transformer preferably uses the primal variables x=(x₁, . . . , x_(n)), dual variables (Lagrange multipliers) y=(λ,v), where: λ=(λ₁, . . . , λ_(p)) is a vector of nonnegative components corresponding to inequality constraints; v=(v₁, . . . , v_(q)) is a vector with unrestricted components corresponding to equality constraints; and k is a scaling parameter.

Disclosed herein are two iterative solvers: MIN_UPDATE and PRIMAL_DUAL. MIN_UPDATE generates a primal-dual sequence {x^(s),y^(s),k^(s)} by the following formulas.

${{x^{s + 1}:{\left( {x^{s + 1},\lambda^{s},v^{s},k^{s}} \right)}} = {\min\limits_{n}{\left( {x,\lambda^{s},v^{s},k^{s}} \right)}}},{\lambda_{i}^{s + 1} = {{\psi'}\left( {{kc}_{i}\left( x^{s + 1} \right)} \right)\lambda_{i}^{s}}},{i = 1},\ldots,p,{v_{j}^{s + 1} = {v_{j}^{s} - {{ke}_{j}\left( x^{s + 1} \right)}}},{j = 1},\ldots,q,{k^{s + 1}:={\gamma\; k^{s}}},{\gamma \geq 1.}$

A specific function minimizer for finding x^(s+1) may be based on Newton method for minimizing

(x,λ^(s),v^(s),k^(s)) in x. Let x:=x^(s). By solving the following linear system ∇_(xx) ²

(x,λ ^(s) ,v ^(s) ,k ^(s))Δx=−∇ _(x)

(x,λ ^(s) ,v ^(s) ,k ^(s)) for Δx, the Newton direction may be found. The new approximation x:=x+tΔx where the step length t>0 may be found by the following procedure.

t:=1, y=(λ^(s),v^(s)), k=k^(s), 0<η<0.5.

while

(x+tΔx,y,k)−

(x,y,k)≧ηt(∇_(x)

(x,y,k),Δx) do

begin

${t:=\frac{t}{l}},$ l>1 end

The minimizer stopping criteria may be defined by the following inequality

x̂ : ∇_(x)(x, λ, v, k) ≤ α(k^(1 + θ))⁻¹max {λ̂ − λ, v̂ − v} where a>0, 0<θ<0.1, {circumflex over (λ)}_(i)={circumflex over (λ)}_(i)ψ′(kc_(i)({circumflex over (x)})), i=1, . . . , p; {circumflex over (v)}_(j)=v_(j)−ke_(j)({circumflex over (x)}), j=1, . . . , q;

The iterative solvers MIN_UPDATE and PRIMAL_DUAL produce the primal-dual sequence {x^(s), y^(s)} up to the point when the general stopping criteria is satisfied. To describe the stopping criteria we may first introduce a merit function such as:

${\mu\left( {x,\lambda,v} \right)} = {\max{\left\{ {{{\nabla_{x}{L\left( {x,\lambda,v} \right)}}},{- {\min\limits_{1 \leq i \leq p}\;{c_{i}(x)}}},{\max\limits_{1 \leq j \leq q}{{e_{j}(x)}}},{\max\limits_{1 \leq i \leq p}{{\lambda_{i}{c_{i}(x)}}}}} \right\}.}}$ For any (x,λ,y) the merit function μ(x,λ,y)≧0 and μ(x,λ,v)=0

x=x*, λ=λ*, v=v*.

If ε>0 is the accuracy of solution, then the general stopping criteria may be for the pair (x,y) to satisfy the inequality: μ(x,λ,y)≦ε.

The following pseudo-code describes an embodiment of a Newton Nonlinear Rescaling method as per the present invention.

Input

An accuracy parameter ε>0

Primal x⁰ε

^(n), Dual λ⁰=(1, . . . , 1)^(T)ε

^(m)

Scaling parameter k>0, τ>0, 0<η<0.5

Begin

x:=x⁰, λ:=λ⁰, v:=v⁰, μ:=μ(x,λ,v,k)

while μ>ε do

-   -   begin     -   while         ∥∇_(x)L( x,λ,ν,k)∥>τk⁻¹min{∥diagψ′(kc_(i)( x))λ—λ∥,k∥e( x)∥}     -    do         -   begin         -   find Δx:∇_(xx)             (x,λ,v,k)Δx=−∇_(x)             (x,λ,v,k)         -   t:=1         -   while             (x+tΔx,λ,v,k)−             (x,λ,v,k)>ηt(∇_(x)             (x,λ,v,k),Δx) do             -   t:=t/2         -   x:=x+tΔx         -   end     -   λ_(i):=ψ′(kc_(i)(x))λ_(i), i=1, . . . , p;         v_(j)=v_(j)−ke_(j)(x), j=1, . . . , q     -   μ=μ(x,λ,v,k)     -   end         end         Output x,λ,v,μ

The iterative solver MIN_UPDATE may be based on Newton's method for minimization of the specific function L(x,y,k) in x followed by the Lagrange multipliers update.

Another iterative solver PRIMAL_DUAL may be based on solving a primal-dual system. Unconstrained minimization of the specific function and updating of the Lagrange multipliers may be equivalent to solving the following primal-dual system of equations for {circumflex over (x)} and ŷ=({circumflex over (λ)},{circumflex over (v)})

${{\nabla{f\left( \hat{x} \right)}} - {\sum\limits_{i = 1}^{p}\;{{\hat{\lambda}}_{i}{\nabla{c_{i}\left( \hat{x} \right)}}}} - {\sum\limits_{j = 1}^{q}\;{{\hat{v}}_{j}{\nabla{e_{j}\left( \hat{x} \right)}}}}} = 0$ {circumflex over (λ)}_(i)=ψ′(kc({circumflex over (x)}))λ_(i) , i=1, . . . , p {circumflex over (v)} _(j) =v _(j) −ke _(j)({circumflex over (x)}), j=1, . . . , q

Newton's method may be performed as part of solving the primal-dual system for ({circumflex over (x)},ŷ). After linearizing the system for ({circumflex over (x)},ŷ)=({circumflex over (x)},{circumflex over (λ)},{circumflex over (v)}),the following linear system of equations for finding the primal-dual Newton direction (Δx,Δy)=(Δx, Δλ,Δv) may be obtained. ∇_(xx) ² L(x,y)Δx−∇c(x)^(T) Δλ−∇e(x)^(T) Δv=−∇ _(x) L(x,y)  (4) −kΛΨ″(kc(x))∇c(x)Δx+Δλ= λ−λ  (5) k∇e(x)Δx+Δv={circumflex over (v)}−v  (6)

where y=( λ,{circumflex over (v)}), λ _(i)=ψ′(kc_(i)(x))λ, i=1, . . . , p, v _(l)=v_(j)−ke_(j)( x), j=1, . . . , q Λ=diag(λ_(i))_(i=1) ^(p), Ψ′(kc(x))=diag(ψ′(kc_(i)(x)))_(i=1) ^(p), Ψ″(kc_(i)(x))=diag(ψ″(kc_(i)(x)))_(i=1) ^(p), ∇c(x) is Jacobian of vector function c(x)=(c₁(x), . . . , c_(p)(x))^(T) and ∇e(x) is Jacobian of vector function e(x)=(e₁(x), . . . , e_(q)(x))^(T) System (4)–(6) may be rewritten as follows:

$\begin{matrix} {{\begin{bmatrix} {\nabla_{xx}^{2}{L\left( {x,y} \right)}} & {- {\nabla{c(x)}^{T}}} & {- {\nabla{e(x)}^{T}}} \\ {- {\nabla{c(x)}}} & \left( {k ⩓ {\Psi^{''}\left( {{kc}(x)} \right)}} \right)^{- 1} & 0 \\ {- {\nabla{e(x)}}} & 0 & {{- k^{- 1}}I_{q}} \end{bmatrix}\left\lbrack \begin{matrix} {\Delta\; x} \\ {\Delta\;\lambda} \\ {\Delta\; v} \end{matrix} \right\rbrack} = \left\lbrack \begin{matrix} {- {\nabla_{x}{L\left( {x,y} \right)}}} \\ {\left( {k ⩓ {\Psi^{''}\left( {{kc}(x)} \right)}} \right)^{- 1}\left( {\overset{\_}{\lambda} - \lambda} \right)} \\ {- {k^{- 1}\left( {\overset{\_}{v} - v} \right)}} \end{matrix} \right\rbrack} & (7) \end{matrix}$

The matrix on the left hand side is symmetric and usually sparse. It may allow solving the system efficiently using modern linear algebra technique. Also, system (4) and (5) may be used to find Δλ and Δv. After substituting Δλand Δv into (4), the following system for finding the primal Newton direction Δx may be obtained. (∇_(xx) ² L(x,y)+zI−k∇c(x)^(T)ΛΨ″(kc(x))∇c(x)+k∇e(x)^(T) ∇e(x))Δx=−∇ _(x) L(x, y )  (8) where parameter z≧0. Matrix M(x,y,k)=∇_(xx) ² L(x,y)+zI−k∇c(x)^(T)ΛΨ″(kc(x))∇c(x)+k∇e(x)^(T) ∇e(x) is symmetric, positive semi-definite for z≧0 and positive definite for z>0. The Newton direction Δλ for the Lagrange multipliers associated with the inequality constraints may be found by formula Δλ=kΛΨ″(kc(x))∇c(x)Δx−λ+ λ  (9)

The Newton direction Δv for the Lagrange multipliers associated with the equality constraints may be found by formula Δv=−k∇e(x)Δx+ v−v  (10)

So one step of the PRIMAL_DUAL iterative algorithm may include:

-   -   1. Finding the dual predictor for the Lagrange multipliers         associated with the inequality constraints by formulas         λ _(i)=ψ′(kc _(i)(x))λ, i=1, . . . , p     -   2. Finding the dual predictor for the Lagrange multipliers         associated with the equality constraints by formulas         v _(j) =v _(j) −ke _(j)( x ), j=1, . . . , q     -   3. Finding the primal corrector Δx by solving the system (8).     -   4. Finding the dual corrector Δλ associated with the inequality         constraints by formula (9).     -   5. Finding the dual corrector Δv associated with the equality         constraints by formula (10).     -   6. Finding the new primal-dual variables by formulas         (primal-dual updater):         -   a) primal: x:=x+Δx.         -   b) new Lagrange multipliers associated with the inequality             constraints:             λ:=λ+Δλ= λ+kΛΨ″(kc(x))∇c(x)Δx         -   c) new Lagrange multipliers associated with the equality             constraints:             v:=v+Δv= v−k∇e(x)Δx     -   7. Updating the scaling parameter by formula         k:=max {kγ, μ(x,λ,v)^(−δ)}, δ>0 γ≧1

We will now discuss an embodiment of the present invention which solves Power Flow Optimization Problems and general constrained optimization problems using a Newton Modified Barrier-Augmented Lagrangian algorithm. This example is a particular embodiment of the present invention in which the Nonlinear Rescaling Lagrangian is the Newton Modified Barrier-Augmented Lagrangian. This example is presented purely for illustrative purposes of this particular embodiment. One skilled in the art will recognize that this embodiment is only illustrative of how the present invention may be used and not inclusive of all embodiments. It is not intended that the present invention be limited to or any specific embodiment.

The electrical utilities worldwide seek cost effective means to increase the operational efficiency of their transmission networks. Two research areas are of great interests for power system analysis: the study of voltage collapse and Optimal Power Flow (OPF) solutions. One of the OPF criteria is loadability limit of the power system. The purpose is to find such OPF, which maximize the loadability. The other possible criteria is the cost of power restoration in case of voltage collapse. The third area of great interest is to find such transformers tap positions that the system may withstand light and peak load.

All these problems may be solved using OPF, a static Nonlinear Optimization (NLP) problem with both inequality constraints and equations. These problems may be defined by a set of physical and operational constraints imposed by equipment limitation and security requirement. Among variables are bus voltages, bus angles, real and reactive generation tap settings of transformers etc. The constraints may include Kirghoff equations, upper and lower bounds for particular variables, as well as limitations imposed by security requirements.

Electric network is operating heavily loaded systems, therefore planning and operation tools preferably address strong nonlinearities in the system's behavior.

Over the last three decades OPF methods used different mathematical programming technique: sequential linear programming, and Newton's based NLP methods. In the last decade, it became very popular to use a different version of the Interior Point Methods (IPM).

The present embodiment of the present invention uses a new approach for constrained optimization problems with both inequality constraints and equations, which is based on Modified Barrier and Augmented Lagrangian (MBAL) theory. This MBAL theory [1] provides the basic framework for the algorithms, which we used to solve the OPF problems, which arise in the first phase of our research.

We start with a general description of the MBAL method.

Let f, c_(i) and d_(j) are smooth enough functions. We consider the following problem x*εX*=Arg min {f(x)|c _(i)(x)≧0, i=1, . . . , p; d _(j)(x)=0, j=1, . . . , q}.  (1)

Since the mid 80s the Interior Point Methods (IPMs) became the most popular tool for solving constrained optimization problems with inequality constraints. The IPMs not only have become the mainstream in the Optimization Community, but also have been widely used in applications and in particular for solving OPF problems [4].

The IPMs for Linear Programming (LP) calculations is a great success story (see [8]).

The situation in Nonlinear Optimization (NLP) is not as bright as in LP. Although the Primal-Dual IPM [7] produced reasonable results for a number of NLP, the ill conditioning, which is typical for the Barrier and Penalty methods, remains a serious issue. The unbounded increase of the barrier parameter, which is the only tool to control the computational process in the IPM calculations, leads to the unbounded increase of the condition number of the correspondent Hessian. So the area, where Newton's method is well-defined shrinks to zero. Therefore to stay in the Newton area one has to increase the barrier parameter very careful. It leads to slow convergence. More drastic increase of the barrier parameter leads to numerical instability.

In LP calculations the ill-conditioning phenomenon was possible to avoid due to the special structure of the correspondent Hessian as well as substantial advances in the numerical linear algebra [5].

In the NLP the structure of the Classical Barrier Function Hessian is fundamentally different than in LP. Therefore there is a substantial gap between efficiency of the IPM for LP and NLP calculations.

The problems, which the electric power industry faces, are nonlinear and large scale by nature.

The OPF problems along with inequality constraints have equations. Therefore it is hard to expect that the IPM may be used efficiently in particular in case of nonlinear equality constraints. Also the ill conditioning effect is much more troubling in NLP calculations than in LP.

Hence there is a need for new mathematical approaches, which may deal with large scale OPF, successfully handle both equations and inequality constraints and avoid the ill-conditioning effect. But, most of all the methods have to be fast and numerically stable.

In the following we describe such an approach, which is based on the Modified Barrier Function (MBF) [2] and Augmented Lagrangian (AL) [6] theories.

The MBF approach may eliminate the basic problems related to the Classical Log-Barrier functions for inequality constraints, whereas the AL eliminates the basic problems associated with the penalty type functions for equality constraints.

By applying the MBF methodology [2] for inequality constraints and by treating the equations with Augmented Lagrangian term [6] we may obtain the MBAL, which is our main tool for solving problem (1). The MBAL function

:

^(n)×

₊ ^(p)×

^(q)×

₊→

is given by formula

${\left( {x,\lambda,v,k} \right)} = {{f(x)} - {k^{- 1}{\sum\limits_{i = 1}^{p}\;{\lambda_{i}{\ln\left( {{{kc}_{i}(x)} + 1} \right)}}}} - {\sum\limits_{i = 1}^{q}\;{v_{i}{d_{i}(x)}}} + {0.5k{\sum\limits_{i = 1}^{q}\;{d_{i}^{2}(x)}}}}$

The function was introduced in [1]. The first two terms represent the Lagrangian for the equivalent problems in the absence of the equality constraints, because for any fixed k>0 the system ln(kc_(i)(x)+1)≧0, i=1, . . . , p is equivalent to c_(i)(x)≧0, i=1, . . . , p.

The last two terms represent the Augmented Lagrangian for equality constraints [6]. Along with the Classical Lagrangian term

$- {\sum\limits_{i = 1}^{q}\;{v_{i}{d_{i}(x)}}}$ there is a penalty part

${0.5k{\sum\limits_{i = 1}^{q}\;{d_{i}^{2}(x)}}},$ which is design to penalize the violation of the equality constraints. Keeping in mind that the MBF function

${F\left( {x,\lambda,k} \right)} = {{f(x)} - {k^{- 1}{\sum\limits_{i = 1}^{p}\;{\lambda_{i}{\ln\left( {{{kc}_{i}(x)} + 1} \right)}}}}}$ has all the characteristics of the Interior Augmented Lagrangian (see [2]), the MBAL

(x,λ,v,k) may be viewed as Interior-Exterior Augmented Lagrangian.

Before we will describe the MBAL multipliers method we would like to emphasize a few important characteristics of the MBAL at the primal-dual solution.

In contrast to the Classical Barrier Function, the MBF exists at the solution together with its derivatives of any order. Moreover for any k>0 MBAL possesses the following important properties at the primal-dual solution.

10.

(x*,λ*,v*,k)=f(x*).

20. ∇_(x)

(x*,λ*,v*,k)=∇_(x)L(x*,λ*,v*)=0 ,

where

${L\left( {x,\lambda,v} \right)} = {{f(x)} - {\sum\limits_{i = 1}^{p}\;{\lambda_{i}{c_{i}(x)}}} - {\sum\limits_{i = 1}^{q}\;{v_{i}{d_{i}(x)}}}}$ is the Classical Lagrangian for the original problem (1).

30.

∇_(xx) ²

(x*,λ* ,v*,k)=∇_(xx) ²L(x*,λ*,v*)+k∇c^(T)(x*)Λ*∇c(x*)+k∇d^(T)(x*)∇d(x*),

where ∇c(x)=J(c(x)) and ∇d(x)=J(d(x)) are Jacobians of c(x) and d(x).

So the MBAL not only exists at the primal-dual solution together with its derivatives of any order but for λ=λ* and v=v* the MBAL is the exact smooth approximation of a nonsmooth function, minimum of which coincides with x*.

Also under the standard second order optimality conditions for (1) the MBAL Hessian ∇_(xx) ²

(x*,λ*,v*,k) is positive definite independently from convexity of f, c_(i), d_(j) for any k≧k₀>0 if k₀ is large enough.

Therefore for any pair (λ,v) close enough to (λ*,v*) the MBAL

(x,λ,v,k) is strongly convex in x no matter whether the objective function and the constraints are convex or not. Keeping in mind the smoothness of

(x,λv,k) in xε

^(n) we may expect that Newton's method for primal minimization MBAL will be efficient.

The MBAL method generates the primal-dual sequence {x^(s),λ^(s),v^(s)} while k>0 may be fixed or one may change k>0 from step to step. We will describe the MBAL method under the fixed barrier-penalty parameter, k>0.

For any x⁰ε

^(n) one may find k>0 such that kc_(i)(x⁰)+1>0 Hence, the numerical realization of the MBAL method in contrast to IPM does not require finding initial interior point. The initial dual approximation is not an issue either, so we may take λ⁰=eε

^(p) and v⁰ε

^(q) as an initial approximation for dual vectors. We assume ln t=−∞, t≦0.

Let's assume that (x^(s),λ^(s),v_(s)) has been already found. The next approximation we find by formulas x ^(s+1) =arg min {

(x,λ ^(s) ,v ^(s) ,k)|xε

^(n)}  (2) i.e. x ^(s+1):∇_(x)

(x ^(s+1),λ^(s) ,v ^(s) ,k)=0  (3) or

$\begin{matrix} {{{\nabla{f\left( x^{s + 1} \right)}} - {\sum\limits_{i = 1}^{p}\;{\frac{\lambda_{i}^{s}}{{{kc}_{i}\left( x^{s + 1} \right)} + 1}{\nabla{c_{i}\left( x^{s + 1} \right)}}}} - {\sum\limits_{j = 1}^{q}\;{\left( {v_{j}^{s} - {{kd}_{j}\left( x^{s + 1} \right)}} \right){\nabla{d_{j}\left( x^{s + 1} \right)}}}}} = {{{\nabla{f\left( x^{s + 1} \right)}} - {\sum\limits_{i = 1}^{p}{\lambda_{i}^{s + 1}{\nabla{c_{i}\left( x^{s + 1} \right)}}}} - {\sum\limits_{j = 1}^{q}\;{\lambda_{j}^{s + 1}{\nabla{d_{j}\left( x^{s + 1} \right)}}}}} = {\nabla_{x}{L\left( {x^{s + 1},\lambda^{s + 1},v^{s + 1}} \right)}}}} & (4) \end{matrix}$

The new Lagrange multipliers may be found by formulas λ_(i) ^(s+1)=λ_(i) ^(s)(kc _(i)(x ^(s+1))+1)⁻¹ , i=1, . . . , p  (5) v _(j) ^(s+1) =v _(j) ^(s) −kd _(j)(x ^(s+1)), j=1, . . . , q  (6)

In other words the Lagrange multipliers for inequality constraints we update as in MBF method [2] while the Lagrange multipliers, which correspond the equality constraints, we update as in Augmented Lagrangian methods [6].

The convergence of the MBAL method is just due to the Lagrange multipliers update while k>0 may be fixed, so the condition number of the MBAL Hessian remains stable and the area where Newton's method for the primal minimization converges does not shrink to a point. So we may expect that the area where Newton's method is “well defined” will remain large enough up to the end of the computational process.

It makes the computation process robust and eventually produces very accurate results.

So MBAL is an exterior point method in primal, because x^(s) usually does not satisfy neither the primal inequality nor the equations.

It was proven in [1] that both the primal sequence and the dual sequence {y^(s)}={λ^(s),v^(s)} converges to the primal-dual solution under the standard second order optimality conditions. Moreover the rate of convergence are Q-linear, i.e. for primal {x^(s)} and dual {y^(s)}={λ^(s), v^(s)} sequences, which were generated by formulas (3)-(6) the following estimation takes place

${{{x^{s + 1} - x^{*}}} \leq {\frac{c}{k}{{y^{s} - y^{*}}}}},{{{y^{s + 1} - y^{*}}} \leq {\frac{c}{k}{{y^{s} - y^{*}}}}},$ where c>0 is independent of k≧k₀>0 and k₀>0 is large enough.

Each step has two basic components: unconstrained minimization of the MBAL

(x,λ^(s),v^(s),k) in x under fixed vector of Lagrange multipliers y^(s)=(λ^(s),v^(s)) and fixed scaling parameter k>0 and update by (5)–(6) of the Lagrange multipliers, using the unconstrained minimizer x^(s+1).

In the next section we describe the Newton MBAL algorithm, which uses Newton's method with the step length for unconstrained minimization and introduce a stopping criteria for the unconstrained minimization, which makes the algorithm practical.

We will now provide a formal description of the Newton MBAL algorithm. To make the MBAL method practical we have to replace the infinite procedure of finding the primal minimizer by a finite procedure. It may be done by introducing well grounded stopping criteria for the primal minimization.

To satisfy the stopping criteria we may use Newton's method with step length for finding an approximation for {circumflex over (x)}=arg min {

(x,λ,v,k)|xε

^(n)} or we may use Newton's method for solving the primal-dual system.

The first direction leads to Newton's MBAL, the second leads to the Primal-Dual MBAL method.

The stopping criteria is based on comparison the norm of the gradient ∇_(x)

(x,λ,v,k) with the norm of the difference between the new and old Lagrange multipliers. Let τ>0 be a chosen parameter. Let us assume that for xε

^(n) the following inequality is satisfied

$\begin{matrix} {{{{\nabla_{x}}\left( {\overset{\_}{x},\lambda,v,k} \right)}} \leq {\tau\; k^{- 1}\min\left\{ {{{{{{diag}\left( {{{kc}_{i}\left( \overset{\_}{x} \right)} + 1} \right)}^{- 1}\lambda} - \lambda}},{k{{d\left( \overset{\_}{x} \right)}}}} \right\}}} & (7) \end{matrix}$ then for the pair of vectors ( x, y), where y=( λ, v), λ=(kC( x)+I)⁻¹λ, v=v−kd( x) the following bound

${\max\left\{ {{{\overset{\_}{x} - x^{*}}},{{\overset{\_}{y} - y^{*}}}} \right\}} \leq {\frac{c\left( {1 + \tau} \right)}{k}{{y - y^{*}}}}$ holds true. The formula (7) is the foundation for the numerical realization of the MBAL method. We start with x⁰ΔΩ_(k)={x:kc_(i)(x)+1≧0, i=1, . . . , p}, λ⁰=eε

₊₊ ^(p) and v⁰ε

^(q). Let us assume that pair ( x ^(s), y ^(s)) has been found already. The next approximation ( x ^(s+1), y ^(s+1)) we find by the following operations: 1. Find

$\begin{matrix} {{\overset{\_}{x}}^{s + 1}:^{{{{\nabla_{y}}{({{\overset{\_}{x}}^{s + 1},{{\overset{\_}{\lambda}}^{s}{\overset{\_}{v}}^{s}},k})}}} \leq {\tau\; k^{- 1}\min{\{{{{{diag}{({{{kc}_{i}{({\overset{\_}{x}}^{s + 1})}} + 1})}}^{{{- 1}{\overset{\_}{\lambda}}^{s}} - {\overset{\_}{\lambda}}^{s}}},{k{{d{({\overset{\_}{x}}^{s - 1})}}}}}\}}}}} & (8) \end{matrix}$ 2. Find new Lagrange multipliers λ _(i) ^(s+1)=(kc _(i)( x ^(s+1))+1)⁻¹ λ _(i) ^(s) , i=1, . . . , p v _(l) ^(s+1) = v _(j) ^(s) −kd _(j)( x ^(s+1)), j=1, . . . , q

To find the approximation for the primal minimizer x ^(s+1) we used Newton's method with step-length for minimizing

(x, λ ^(s), v ^(s), k) in x. In other words the primal Newton's direction Δx we find from the following system ∇_(xx)

(x, λ ^(s) , v ^(s) ,k)Δx=−∇ _(x)

(x, λ ^(s) , v ^(s) , k)  (9)

The Hessian ∇_(xx)

(x, λ ^(s), v ^(s),k) we compute by formula ∇_(xx)

(x, λ ^(s) , v ^(s) ,k)=∇_(xx) L(x, λ ^(s) , v ^(s))+k∇c(x)^(T) Λ ^(s)(kC(x)+I)⁻¹ ∇c(x)+k∇d ^(T)(x)∇d(x) where λ ^(s+1)=(kC( x ^(s+1))+I)⁻¹ λ ^(s), v ^(s+1)= v ^(s)−kd( x ^(s+1)), (kC(x)+I)=diag(kc_(i)(x)+1)_(t=1) ^(p).

The gradient ∇_(x)

(x, λ ^(s), v ^(s),k)=∇_(x)L(x, λ ^(s+1), v _(s+1)).

The numerical realization of the MBAL leads to Newton's MBAL method.

The Newton's MBAL method consists of using Newton's method with steplength for minimization of

(x, λ ^(s), v ^(s),k) in xε

^(n) following by the Lagrange multipliers update using approximation x ^(s+1), which satisfies the criteria (8). The chart below describes Newton NR method.

We will first introduce a merit function, which may measure the violation of the optimality condition.

Let us define the merit function μ:

^(n)×

₊ ^(p)×

^(q)×

₊₊ ¹→

¹ by the following formula

${\mu( \cdot )} = {{\mu\left( {x,\lambda,v,k} \right)} = {\max\left\{ {{\underset{1\underset{\_}{<}i\underset{\_}{<}p}{- \min}\;{c_{1}(x)}},{\max\limits_{1\underset{\_}{<}j\underset{\_}{<}q}{{d_{j}(x)}}},{{{\nabla\;}\left( {x,\lambda,v,k} \right)}},{\sum\limits_{i = 1}^{p}\;{\lambda_{i}{{c_{i}(x)}}}},{\sum\limits_{i = 1}^{q}\;{{v_{i}}{{d_{i}(x)}}}},} \right\}}}$

It is easy to see, that for any k>0 the function μ(.) is nonnegative and μ(x,λ,v,k)=0 iff x=x*,λ=λ*,v=v* Input

An accuracy parameter ε>0

Primal x⁰ε

^(n), Dual λ⁰=(1, . . . , 1)^(T)ε

^(m)

Scaling parameter k>0, τ>0, 0<η<0.5

Begin

x:=x⁰, λ:=λ⁰:v:=v⁰, μ:=μ(x,λ,v,k)

while μ>ε do

-   -   begin     -   while

${{{\nabla_{x}}\left( {x,\lambda,v,k} \right)}} > {\tau\; k^{- 1}\min\left\{ {{{{{{diag}\left( {{{kc}_{i}\left( \overset{\_}{x} \right)} + 1} \right)}^{- 1}\lambda} - \lambda}},{k{{d\left( \overset{\_}{x} \right)}}}} \right\}}$

-   -    do         -   begin         -   find Δx:∇_(xx)             (x,λ,v,k)Δx=−∇_(x)             (x,λ,v,k)             -   t:=1             -   while                 (x+tΔx,λ,v,k)−                 (x,λ,v,k)>ηt(∇_(x)                 (x,λ,v,k),Δx) do             -   t:=t/2         -   x:=x+tΔx         -   end     -   λ_(i):=(1+kc_(i)(x))⁻¹, i=1, . . . , p; v_(j)=v_(j)−kd_(j)(x),         j=1, . . . , q     -   μ=μ(x,λ,v,k)     -   end         end         Output x,λ,v,μ

As we may see from the MBAL algorithm the most costly operation is finding Newton's direction. It requires solving system (9). The dimension of the primal space defines the size of the system. Therefore the dimension of the primal space is much more important than the number of constraints both inequalities and equations.

The most time consuming part is the first few MBAL primal minimizations. After few Lagrange multipliers update the Primal optimization does not require much effort, because the Lagrange multipliers become close to their optimal value.

The main task of the proposed research is to improve the first phase of the Newton MBAL. The second task is to find an optimal strategy for the penalty barrier parameter k>0 update, which allows to reach the “hot start” as soon as possible.

From “hot start” on, it requires very few and often even one Newton's step for the Lagrange multipliers update, which reduces the distance between the primal-dual approximation to the primal-dual solution by a factor γ=ck⁻¹, where c>0 is independent on k≧k₀. It happens because Newton's area, i.e. the area where Newton's method is “well defined” [2] does not shrink to a point, it remains stable when the primal dual approximation approaches the primal-dual solution. It distinguishes fundamentally the MBAL approach from the IPM or penalty type methods.

The following references are included in this specification by reference to provide support for the state of art relied upon in describing the present invention.

-   [1] D. Goldfarb, K. Mints, R. Polyak, I. Yuzefovich, Modified     Barrier-Augmented Lagrangian Method for Constrained Minimization,     Computational Optimization and Applications, 14, p 55-74, 1999. -   [2] R. Polyak, Modified Barrier Functions, Mathematical Programming     54 (1992) 177-222 North-Holland. -   [3] S. Nash and J. Nacedal, A numerical study of the limited memory     BFGS method and the truncated-Newton method for large Scale     Optimization, SIAM Journal on Optimization 1 (1991) pp. 358-372. -   [4] I. Nejdawi, K. Clements, P. Davis, An Efficient Interior Point     Method for Sequential Quadratic Programming Based on Optimal Power     Flow, IEEE Transactions on Power Systems, 15(4), 1179-1183, 2000. -   [5] E. Ng, B. W. Peyton, Block sparse Cholesky algorithms on     advanced uniprocessor computers, SIAM Journal of Scientific     Computing, 14 (1993), pp. 1034-1056. -   [6] M. J. D. Powell, A method for nonlinear constraints in     minimization problems, Optimization, Ed. Fletcher, London, Acad.     Press, 1969, 283-298. -   [7] R. Vandebei, D. Shanno, An interior point algorithm for     nonconvex nonlinear programming, Computational Optimization and     Applications 13, 231-252,1999. -   [8] S. Wright, Primal-Dual Interior Points methods, SIAM, 1997.

The foregoing descriptions of the preferred embodiments of the present invention have been presented for purposes of illustration and description. They are not intended to be exhaustive or to limit the invention to the precise forms disclosed, and obviously many modifications and variations are possible in light of the above teaching. The illustrated embodiments were chosen and described in order to best explain the principles of the invention and its practical application to thereby enable others skilled in the art to best utilize the invention in various embodiments and with various modifications as are suited to the particular use contemplated. 

1. A tangible computer readable medium containing a computer program comprising: a) a mathematical formulation describing a constrained optimization problem for a physical system; said mathematical formulation including: i) variables x=(x₁, . . . , x_(n)); ii) an objective function f(x); and iii) at least one constraint selected from the group consisting of: (1) an inequality constraint c_(i)(x)≧0, i=1, . . . , p; and (2) an equality constraint e_(j)(x)=0, j=1, . . . , q; b) a class of transformation functions with a predefined set of properties; c) Lagrange multipliers λ=(λ₁, . . . , λ_(p)), v=(v₁, . . . , v_(q)) d) a scaling parameter k; e) a transformer capable of building a specific function L(x,λ,v,k) from said mathematical formulation, said Lagrange multipliers and said scaling parameter using said class of transformation functions, said specific function including ${{f(x)} - {k^{- 1}{\sum\limits_{i = 1}^{p}{\lambda_{i}{\psi\left( {{kc}_{i}(x)} \right)}}}} - {\sum\limits_{j = 1}^{q}{v_{j}{e_{j}(x)}}} + {0.5{\sum\limits_{j = 1}^{q}{{ke}_{i}^{2}(x)}}}};$ f) a Lagrange multipliers updater capable of calculating updated Lagrange multipliers {circumflex over (λ)}=({circumflex over (λ)}₁, . . . , {circumflex over (λ)}_(m)), {circumflex over (v)}=({circumflex over (v)}₁, . . . , {circumflex over (v)}_(q)); g) a scaling parameter updater capable of calculating an updated scaling parameter {circumflex over (k)}; h) a merit function calculator capable of calculating a merit function μ(x,λ,v); i) a general stopping criteria verifier; j) an accuracy of solution parameter (ε); and k) an iterative solver capable using said specific function, said Lagrange multipliers updater and said scaling parameter updater to generate a solution; and wherein said solution is applied to said physical system.
 2. A medium according to claim 1, wherein said predefined set of properties includes: i) ψ(t):

¹→

¹ defined on −∞≦a<t<b≦∞; ii) ψ(0)=0; iii) ψ′(0)=1; iv) ψ′(t)>0; v) ψ″(t)<0; and vi) ${\lim\limits_{t->b}\;{{\psi'}(t)}} = 0.$
 3. A medium according to claim 2, wherein said predefined set of properties further includes: i) ψ″(t)<0; and ii) ${\lim\limits_{t->b}\;{{\psi'}(t)}} = 0.$
 4. A medium according to claim 2, wherein said inequality constraint is c_(i)(x)≦0; i=1, . . . , p and said predefined set of properties further includes: i) ψ″(t)>0; and ii) ${\lim\limits_{t->a}\;{{\psi'}(t)}} = 0.$
 5. A medium according to claim 1, wherein said mathematical formulation includes said objective function being minimized, subject to said inequality constraints and said equality constraints.
 6. A medium according to claim 1, wherein said Lagrange multipliers updater includes Lagrange multipliers update formulas.
 7. A medium according to claim 6, wherein said Lagrange multipliers update formulas include {circumflex over (λ)}_(i)=λ_(i)ψ′(kc_(i)({circumflex over (x)})), i=1, . . . , p.
 8. A medium according to claim 6, wherein said Lagrange multipliers update formulas include {circumflex over (v)}_(j)=v_(j)−ke_(j)({circumflex over (x)}), j=1, . . . , q.
 9. A medium according to claim 1, wherein said scaling parameter updater includes scaling parameter update formula {circumflex over (k)}=max {kγ,μ({circumflex over (x)},{circumflex over (λ)},{circumflex over (v)})^(−δ)}, δ>0, γ≧1.
 10. A medium according to claim 1, wherein said iterative solver includes a general stopping criteria verifier for determining when said iterative solver should terminate.
 11. A medium according to claim 1, wherein said iterative solver includes a general stopping criteria verifier uses a general stopping criteria.
 12. A medium according to claim 10, wherein said general stopping criteria verifier uses said accuracy of solution parameter.
 13. A medium according to claim 12, wherein said general stopping criteria verifier considers when said merit function is equal or less than said accuracy of solution parameter.
 14. A medium according to claim 1, wherein said iterative solver is a MIN_UPDATE solver.
 15. A medium according to claim 1, wherein said iterative solver is a PRIMAL_DUAL solver.
 16. A medium according to claim 14, wherein said MIN_UPDATE solver includes: a) a specific function minimizer for performing an unconstrained minimization in variables of said specific function with determined said Lagrange multipliers and said scaling parameter; said specific function minimizer capable of producing updated variables; b) a minimizer stopping criteria checker for determining when said specific function minimizer should terminate; c) said Lagrange multipliers updater for calculating said updated Lagrange multipliers using said updated variables, said Lagrange multipliers and said Lagrange multipliers update formula; d) said scaling parameter updater for calculating said updated scaling parameter using said updated variables, said updated Lagrange multipliers, said scaling parameter and said scaling parameter update formula; and e) said general stopping criteria verifier.
 17. A medium according to claim 16, wherein said specific function minimizer uses a Newton's method.
 18. A medium according to claim 16, wherein said MIN_UPDATE solver further includes an accuracy of minimizer parameter (ε_(m)) and a minimizer stopping criteria uses said accuracy of minimizer parameter.
 19. A medium according to claim 16, wherein said updated variables ({circumflex over (x)}) must satisfy a minimizer stopping criteria.
 20. A medium according to claim 16, wherein said scaling parameter updater uses said merit function.
 21. A medium according to claim 16, wherein a minimizer stopping criteria includes at least one of the following selected from the group consisting of: a) said updated variables; b) said Lagrange multipliers; c) said scaling parameter; d) said updated Lagrange multipliers; and e) a stopping inequality verifier.
 22. A medium according to claim 21, wherein said stopping inequality verifier is select from the group consisting of: $\begin{matrix} \left. a \right) & {{{\hat{x}:{{{\nabla_{x}{L\left( {\hat{x},\lambda,v,k} \right)}}} \leq ɛ_{m}}};\mspace{11mu}{and}}\;} \\ \left. b \right) & {{\hat{x}:{{{\nabla_{x}{L\left( {\hat{x},\lambda,v,k} \right)}}} \leq {{\alpha\left( k^{1 + \theta} \right)}^{- 1}\max\left\{ {{{\hat{\lambda} - \lambda}},{{\hat{v} - v}}} \right\}}}},{\alpha > 0},{0 < \theta < {0.1.}}} \end{matrix}\;$
 23. A medium according to claim 15, wherein said PRIMAL_DUAL solver includes: a) a primal-dual system of equations, including: i) a gradient of classical Lagrangian ${{\nabla{f(x)}} - {\sum\limits_{i = 1}^{p}{\lambda_{i}{\nabla{c_{i}(x)}}}} - {\sum\limits_{j = 1}^{q}{v_{j}{\nabla{e_{j}(x)}}}}};$  and ii) said Lagrange multipliers update formulas; b) a linear system for Newton directions; c) a predictor-corrector algorithm for solving said linear system for Newton directions; and d) said scaling parameter update formula.
 24. A medium according to claim 23, wherein said gradient of classical Lagrangian equals zero.
 25. A medium according to claim 23, wherein said predictor-corrector algorithm includes: a) inequality predictors ( λ) for said Lagrange multipliers associated with inequality constraints; b) equality predictors ( v) for said Lagrange multipliers associated with equality constraints; c) a primal corrector (Δx); d) a primal linear system for finding said primal corrector; e) inequality correctors (Δλ) for said Lagrange multipliers associated with inequality constraints; f) equality correctors (Δv) for said Lagrange multipliers associated with equality constraints; and g) a primal-dual updater.
 26. A tangible computer readable medium containing a computer program, the computer program implementing a method for finding a solution to a constrained optimization problem for a physical system, the method comprising the steps of: a) defining a mathematical formulation describing said problem; said mathematical formulation including: i) variables x=(x₁, . . . , x_(n)); ii) an objective function f(x); iii) inequality constraints c_(i)(x)≧0, i=1, . . . , p; and iv) equality constraints e_(j)(x)=0, j=1, . . . , q ; b) selecting initial Lagrange multipliers λ=(λ₁, . . . , λ_(p)), v=(v₁, . . . , v_(q)); c) selecting an initial scaling parameter k; d) selecting initial variables x=(x₁, . . . , x_(n)); e) building a specific function L(x,λ,v,k) from said mathematical formulation, said initial Lagrange multipliers and said initial scaling parameter using an element of a class of transformation functions having a predefined set of properties, said specific function further includes ${{f(x)} - {k^{- 1}{\sum\limits_{i = 1}^{p}{\lambda_{i}{\psi\left( {{kc}_{i}(x)} \right)}}}} - {\sum\limits_{j = 1}^{q}{v_{j}{e_{j}(x)}}} + {0.5{\sum\limits_{j = 1}^{q}{{ke}_{i}^{2}(x)}}}};$ f) performing a nonlinear resealing augmented Lagrangian iterative algorithm; and g) applying said solution to said physical system.
 27. The medium according to claim 26, wherein said step of performing a nonlinear resealing augmented Lagrangian iterative algorithm includes iteratively: a) performing a minimization of said specific function; b) calculating updated Lagrange multipliers {circumflex over (λ)}=({circumflex over (λ)}₁, . . . , {circumflex over (λ)}_(m)), {circumflex over (v)}=({circumflex over (v)}₁, . . . , {circumflex over (v)}_(q) c) calculating an updated scaling parameter {circumflex over (k)}; d) calculating a merit function μ(x,λ,v); and e) stopping iterations when a general stopping criteria using an accuracy of solution parameter (ε) is satisfied.
 28. The medium according to claim 26, wherein said step of performing a nonlinear resealing augmented Lagrangian iterative algorithm (PRIMAL_DUAL) includes iteratively: a) solving a primal-dual system of equations, said primal-dual system of equations including: i) a gradient of classical Lagrangian ${{\nabla{f(x)}} - {\sum\limits_{i = 1}^{p}{\lambda_{i}{\nabla{c_{i}(x)}}}} - {\sum\limits_{j = 1}^{q}{v_{j}{\nabla{e_{j}(x)}}}}};$  and ii) said Lagrange multipliers update formulas; b) solving a linear system for Newton directions; c) performing a predictor-corrector algorithm for solving said linear system for Newton directions; d) updating primal dual variables; and e) updating said initial scaling parameter.
 29. A medium according to claim 1, wherein said physical system is an electrical transmission network.
 30. A medium according to claim 26, wherein said physical system is an electrical transmission network. 